Approximate Nearest Neighbor Search Using Enhanced Accumulative Quantization

نویسندگان

چکیده

Approximate nearest neighbor (ANN) search is fundamental for fast content-based image retrieval. While vector quantization one key to performing an effective ANN search, in order further improve accuracy, we propose enhanced accumulative (E-AQ). Based on our former work, introduced the idea of quarter point into (AQ). Instead finding centroid, was used quantize and computed each according its centroid second centroid. Then, error produced through codebook training reduced without increasing number centroids codebook. To evaluate accuracy which vectors were approximated by their outputs, realized E-AQ-based exhaustive method search. Experimental results show that approach gained up 0.996 0.776 Recall@100 with eight size 256 codebooks SIFT GIST datasets, respectively, at least 1.6% 4.9% higher than six other state-of-the-art methods. Moreover, based experimental results, E-AQ needs fewer while still providing same accuracy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Composite Quantization for Approximate Nearest Neighbor Search

This paper presents a novel compact coding approach, composite quantization, for approximate nearest neighbor search. The idea is to use the composition of several elements selected from the dictionaries to accurately approximate a vector and to represent the vector by a short code composed of the indices of the selected elements. To efficiently compute the approximate distance of a query to a ...

متن کامل

Approximate Nearest Neighbor Search by Residual Vector Quantization

A recently proposed product quantization method is efficient for large scale approximate nearest neighbor search, however, its performance on unstructured vectors is limited. This paper introduces residual vector quantization based approaches that are appropriate for unstructured vectors. Database vectors are quantized by residual vector quantizer. The reproductions are represented by short cod...

متن کامل

Transformed Residual Quantization for Approximate Nearest Neighbor Search

The success of product quantization (PQ) for fast nearest neighbor search depends on the exponentially reduced complexities of both storage and computation with respect to the codebook size. Recent efforts have been focused on employing sophisticated optimization strategies, or seeking more effective models. Residual quantization (RQ) is such an alternative that holds the same property as PQ in...

متن کامل

Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph

We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.

متن کامل

Searching with quantization: approximate nearest neighbor search using short codes and distance estimators

We propose an approximate nearest neighbor search method based on quantization. It uses, in particular, product quantizer to produce short codes and corresponding distance estimators approximating the Euclidean distance between the orginal vectors. The method is advantageously used in an asymmetric manner, by computing the distance between a vector and code, unlike competing techniques such as ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2022

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics11142236